On the ⋆-Sylvester equation AX ± X⋆ B⋆ = C

نویسندگان

  • Chun-Yueh Chiang
  • Eric King-Wah Chu
  • Wen-Wei Lin
چکیده

We consider the solution of the ?-Sylvester equation AX±X?B? = C, for ? = T,H and A,B,∈ Cm×n, and some related linear matrix equations (AXB? ± X? = C, AXB? ± CX?D? = E, AX ± X?A? = C, AX ± Y B = C, AXB ± CY D = E, AXA? ± BY B? = C and AXB ± (AXB)? = C). Solvability conditions and stable numerical methods are considered, in terms of the (generalized and periodic) Schur, QR and (generalized) singular value decompositions. We emphasize on the square cases where m = n but the rectangular cases will be considered. The ?-sylvester equation is important in the solution of some generalized algebraic Riccati equations by Newton’s method.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Residual norm steepest descent based iterative algorithms for Sylvester tensor equations

Consider the following consistent Sylvester tensor equation[mathscr{X}times_1 A +mathscr{X}times_2 B+mathscr{X}times_3 C=mathscr{D},]where the matrices $A,B, C$ and the tensor $mathscr{D}$ are given and $mathscr{X}$ is the unknown tensor. The current paper concerns with examining a simple and neat framework for accelerating the speed of convergence of the gradient-based iterative algorithm and ...

متن کامل

Master ’ s Thesis Proposal , 20 credits : ScaLAPACK - style algorithms for Periodic Matrix Equations

1 Motivation This Master's Thesis project considers software for solving periodic Sylvester-type matrix equations. Recently, the ScaLAPACK-style library SCASY was completed. SCASY is a parallel HPC software library that solves for 42 sign and transpose variant of 8 common standard and generalized Sylvester-type matrix equations (see Table 1) which builds on the Table 1: The Sylvester-type matri...

متن کامل

Global conjugate gradient method for solving large general Sylvester matrix equation

In this paper, an iterative method is proposed for solving large general Sylvester matrix equation $AXB+CXD = E$, where $A in R^{ntimes n}$ , $C in R^{ntimes n}$ , $B in R^{stimes s}$ and  $D in R^{stimes s}$ are given matrices and $X in R^{stimes s}$  is the unknown matrix. We present a global conjugate gradient (GL-CG) algo- rithm for solving linear system of equations with multiple right-han...

متن کامل

Gauss-Sidel and Successive Over Relaxation Iterative Methods for Solving System of Fuzzy Sylvester Equations

In this paper, we present Gauss-Sidel and successive over relaxation (SOR) iterative methods for finding the approximate solution system of fuzzy Sylvester equations (SFSE), AX + XB = C, where A and B are two m*m crisp matrices, C is an m*m fuzzy matrix and X is an m*m unknown matrix. Finally, the proposed iterative methods are illustrated by solving one example.

متن کامل

On the solving matrix equations by using the spectral representation

‎The purpose of this paper is to solve two types of Lyapunov equations and quadratic matrix equations by using the spectral representation‎. ‎We focus on solving Lyapunov equations $AX+XA^*=C$ and $AX+XA^{T}=-bb^{T}$ for $A‎, ‎X in mathbb{C}^{n times n}$ and $b in mathbb{C} ^{n times s}$ with $s < n$‎, ‎which $X$ is unknown matrix‎. ‎Also‎, ‎we suggest the new method for solving quadratic matri...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Applied Mathematics and Computation

دوره 218  شماره 

صفحات  -

تاریخ انتشار 2012